Short paths in quasi-random triple systems with sparse underlying graphs
نویسندگان
چکیده
A. The regularity lemma for 3-uniform hypergraphs asserts that every large hypergraph can be decomposed into a bounded number of quasi-random structures consisting of a sub-hypergraph and a sparse underlying graph. In this paper we show that in such a quasirandom structure most pairs of the edges of the graph can be connected by hyperpaths of length at most twelve. Some applications are also given.
منابع مشابه
Large Holes in Quasi-Random Graphs
Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths ...
متن کاملSparse Quasi-Random Graphs
Quasi-random graph properties form a large equivalence class of graph properties which are all shared by random graphs. In recent years, various aspects of these properties have been treated by a number of authors (e.g., see [5]-[14], [16], [23]-[27]). Almost all of these results deal with dense graphs, that is, graphs on n vertices having cn edges for some c > 0 as n → ∞. In this paper, we ext...
متن کاملQuasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph “resembles” a random one. Moreover, a regular partition approximates a given graph by a bounded number of quasi-random graphs. Regarding quasi-randomness, we present a new spectral characterization of low discrepancy, which ex...
متن کاملDiscrepancy and Eigenvalues of Cayley Graphs
We consider quasirandom properties for Cayley graphs of finite abelian groups. In particular, we show that having uniform edgedistribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for Cayley graphs, even if they are sparse. This positively answers a question of Chung and Graham [“Sparse quasi-random graphs”, Combinatorica 22 (2002), no. 2, 217–244] for...
متن کاملCS599: Structure and Dynamics of Networked Information (Spring 2005) 03/30/2005: Small World
We have observed that random graphs do not model social networks well, as social networks exhibit a lot of clustering, whereas triangles or other small cycles are rare in sparse random graphs. Instead, we considered a model proposed by Watts and Strogatz [3] that superimposed random edges on top of a clustered graph, e.g., a grid graph, thus obtaining both high clustering and small diameter. Ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 96 شماره
صفحات -
تاریخ انتشار 2006